Graph coloring - PDFSEARCH.IO - Document Search Engine

Graph coloring
Results: 948

#	Item
211	Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond Klaus-Tycho F¨ orster, Rijad Nuridini, Jara Uitto, and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerlan Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-07-11 07:39:59 Graph theory Pursuit-evasion Planar graph Matching Graph Neighbourhood Graph coloring Entanglement Graph operations Tree-depth
212	Activity 13 The poor cartographer—Graph coloring Age group Early elementary and up. Abilities assumed Coloring in. Add to Reading List Source URL: csunplugged.org Language: English - Date: 2014-12-09 16:29:33
213	Obstructions for three-coloring graphs without induced paths on six vertices Maria Chudnovsky∗1 , Jan Goedgebeur†2 , Oliver Schaudt3 , and Mingxian Zhong4 1 Princeton University, Princeton, NJ 08544, USA. E-mail: mc Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2015-09-19 08:52:09 Graph theory Graph coloring NP-complete problems Line graph Matching Neighbourhood Chordal graph Graph Block graph Covering graph
214	Efficient Densest Subgraph Computation in Evolving Graphs Alessandro Epasto∗ Silvio Lattanzi Add to Reading List Source URL: www.epasto.org Language: English - Date: 2015-07-21 16:42:36 Graph theory Mathematics Spanning tree Dense subgraph Graph coloring Combinatorial optimization Routing algorithms Line graph Tree-depth
215	The graph formulation of the union-closed sets conjecture Henning Bruhn1 , Pierre Charbit∗2 , Oliver Schaudt1 , and Jan Arne Telle†3 1 Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-06-05 04:13:35 Graph theory Mathematics Graph coloring Matching Graph operations Order theory Bipartite graph Union-closed sets conjecture Graph minor Chordal bipartite graph Chordal graph Clique
216	The union-closed sets conjecture almost holds for almost all random bipartite graphs Henning Bruhn and Oliver Schaudt Abstract Frankl’s union-closed sets conjecture states that in every finite unionclosed family of set Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2013-05-11 13:53:39 Graph theory Mathematics Graph coloring Combinatorial optimization Matching NP-complete problems Bipartite graph Union-closed sets conjecture Maximal independent set Triangle-free graph
217	Accelerating Irregular Computations with Hardware Transactional Memory and Active Messages Maciej Besta Torsten Hoefler Add to Reading List Source URL: htor.inf.ethz.ch Language: English - Date: 2015-09-14 07:27:20 Graph theory Mathematics Computing Concurrency control Transaction processing NP-complete problems Computer memory Transactional memory Vertex Breadth-first search Graph coloring Transactional Synchronization Extensions
218	On the Enumeration of Bipartite Minimum Edge Colorings Yasuko MATSUI and Takeaki UNO Abstract. For a bipartite graph G = (V, E), an edge coloring of G is a coloring of the edges of G such that any two adjacent edges are Add to Reading List Source URL: research.nii.ac.jp Language: English - Date: 2010-09-24 01:42:07
219	Efficient Algorithms for Private-Public Social Networks Flavio Chierichetti (Sapienza U. of Rome), Alessandro Epasto (Brown U.), Ravi Kumar, Silvio Lattanzi, Vahab Mirrokni (Google). , epasto@cs.b Add to Reading List Source URL: www.epasto.org Language: English - Date: 2015-09-24 11:11:53 Graph theory Graph connectivity Reachability Graph operations Graph coloring
220	Structural parameterizations for boxicity Henning Bruhn, Morgan Chopin, Felix Joos and Oliver Schaudt Abstract The boxicity of a graph G is the least integer d such that G has an intersection model of axis-aligned d-dime Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-02-20 07:20:59 Boxicity Geometric graph theory Planar graphs Pathwidth Intersection graph Treewidth Chordal graph Clique Interval graph Outerplanar graph Vertex cover Graph coloring

UPDATE